┌ Warning: Module Groebner with build ID fafbfcfd-36ca-1ab6-0000-0c12f01cbcb6 is missing from the cache.
│ This may mean Groebner [0b43b601-686d-58a3-8a1c-6623616c7cd4] does not support precompilation but is imported by a module that does.
└ @ Base loading.jl:1793
WARNING: using OrdinaryDiffEq.islinear in module ModelingToolkit conflicts with an existing identifier.
WARNING: using OrdinaryDiffEq.isconstant in module ModelingToolkit conflicts with an existing identifier.
┌ Warning: The call to compilecache failed to create a usable precompiled cache file for SparseDiffToolsSymbolicsExt [cd430d6f-1330-5ba3-8763-ae950e38ad4f]
│   exception = Invalid input in module list: expected Symbolics.
└ @ Base loading.jl:1818
┌ Error: Error during loading of extension SparseDiffToolsSymbolicsExt of SparseDiffTools, use `Base.retry_load_extensions()` to retry.
│   exception =
│    1-element ExceptionStack:
│    Declaring __precompile__(false) is not allowed in files that are being precompiled.
│    Stacktrace:
│      [1] _require(pkg::Base.PkgId, env::Nothing)
│        @ Base ./loading.jl:1825
│      [2] _require_prelocked(uuidkey::Base.PkgId, env::Nothing)
│        @ Base ./loading.jl:1660
│      [3] _require_prelocked(uuidkey::Base.PkgId)
│        @ Base ./loading.jl:1658
│      [4] run_extension_callbacks(extid::Base.ExtensionId)
│        @ Base ./loading.jl:1255
│      [5] run_extension_callbacks(pkgid::Base.PkgId)
│        @ Base ./loading.jl:1290
│      [6] run_package_callbacks(modkey::Base.PkgId)
│        @ Base ./loading.jl:1124
│      [7] _tryrequire_from_serialized(modkey::Base.PkgId, path::String, ocachepath::String, sourcepath::String, depmods::Vector{Any})
│        @ Base ./loading.jl:1398
│      [8] _require_search_from_serialized(pkg::Base.PkgId, sourcepath::String, build_id::UInt128)
│        @ Base ./loading.jl:1494
│      [9] _require(pkg::Base.PkgId, env::String)
│        @ Base ./loading.jl:1783
│     [10] _require_prelocked(uuidkey::Base.PkgId, env::String)
│        @ Base ./loading.jl:1660
│     [11] macro expansion
│        @ ./loading.jl:1648 [inlined]
│     [12] macro expansion
│        @ ./lock.jl:267 [inlined]
│     [13] require(into::Module, mod::Symbol)
│        @ Base ./loading.jl:1611
│     [14] include(mod::Module, _path::String)
│        @ Base ./Base.jl:457
│     [15] include(x::String)
│        @ ModelingToolkit ~/.julia/packages/ModelingToolkit/okjHa/src/ModelingToolkit.jl:4
│     [16] top-level scope
│        @ ~/.julia/packages/ModelingToolkit/okjHa/src/ModelingToolkit.jl:124
│     [17] include
│        @ ./Base.jl:457 [inlined]
│     [18] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String)
│        @ Base ./loading.jl:2049
│     [19] top-level scope
│        @ stdin:3
│     [20] eval
│        @ ./boot.jl:370 [inlined]
│     [21] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)
│        @ Base ./loading.jl:1903
│     [22] include_string
│        @ ./loading.jl:1913 [inlined]
│     [23] exec_options(opts::Base.JLOptions)
│        @ Base ./client.jl:305
│     [24] _start()
│        @ Base ./client.jl:522
└ @ Base loading.jl:1261
WARNING: using OrdinaryDiffEq.isconstant in module ModelingToolkit conflicts with an existing identifier.
WARNING: using OrdinaryDiffEq.islinear in module ModelingToolkit conflicts with an existing identifier.
┌ Info: 
└   FUNCTION_NAME = "find_identifiable_functions"
┌ Info: 
└   PROBLEM_NAME = "SEIR 36 ref"
┌ Info: 
└   KWARGS = (with_states = true, strategy = (:normalforms, 2))
┌ Info: 
└   GLOBAL_ID = Symbol("(:normalforms, 2)_with_states")
┌ Warning: The call to compilecache failed to create a usable precompiled cache file for ModelingToolkit [961ee093-0014-501f-94e3-6117800e7a78]
│   exception = Required dependency Symbolics [0c5d862f-8b57-4792-8d23-62f2024744c7] failed to load from a cache file.
└ @ Base loading.jl:1818
[ Info: Summary of the model:
[ Info: State variables: N, nu, q, S, E, I, De, Di, R, F
[ Info: Parameters: gamma, phi, mu_0, s_d, mu_d, s, mu_i, beta, phi_e, gamma_d, beta_d
[ Info: Inputs: 
[ Info: Outputs: y1, y2, y5, y3, y4, y6
[ Info: Summary of the model:
[ Info: State variables: x1, x2
[ Info: Parameters: a, b, d, c
[ Info: Inputs: 
[ Info: Outputs: y
[ Info: Computing IO-equations
┌ Info: Computed in 15.281896062 seconds
│   :ioeq_time = :ioeq_time
└   ioeq_time = 15.281896062
[ Info: Computing Wronskians
┌ Info: Computed in 11.984745988 seconds
│   :wrnsk_time = :wrnsk_time
└   wrnsk_time = 11.984745988
[ Info: Dimensions of the Wronskians [47, 1, 4, 5, 1, 1]
┌ Info: Ranks of the Wronskians computed in 0.033317953 seconds
│   :rank_time = :rank_time
└   rank_times = 0.033317953
┌ Warning: One of the Wronskians has corank greater than one, so the results of the algorithm will be valid only for multiexperiment identifiability. If you still  would like to assess single-experiment identifiability, we recommend using SIAN (https://github.com/alexeyovchinnikov/SIAN-Julia)
└ @ StructuralIdentifiability ~/StructuralIdentifiability.jl/src/global_identifiability.jl:111

⌜ # Computing specializations..  	 Time: 0:00:09[K
✓ # Computing specializations..  	 Time: 0:00:10[K

⌜ # Computing specializations..  	 Time: 0:00:04[K
✓ # Computing specializations..  	 Time: 0:00:04[K
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 1 for num. and 0 for den.
│ Maximal number of interpolated terms are: 1 for num. and 1 for den.
└ Points used: 6.
[ Info: Groebner basis computed in 12.629419526 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 4.354744416 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 12 rational functions
┌ Info: Final cleaning and simplification of generators. 
└ Out of 11 fractions 11 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 4.929207254 seconds. Result: true
[ Info: Out of 53 initial generators there are 11 indepdendent
[ Info: The ranking of the new set of generators is 66
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 1 for num. and 2 for den.
│ Maximal number of interpolated terms are: 1 for num. and 1 for den.
└ Points used: 10.
[ Info: Groebner basis computed in 5.272475063 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 1.495628862 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 22 rational functions
┌ Info: Computing normal forms (probabilistic)
│ Variables (21 in total): Nemo.QQMPolyRingElem[gamma, phi, mu_0, s_d, mu_d, s, mu_i, beta, phi_e, gamma_d, beta_d, N, nu, q, S, E, I, De, Di, R, F]
│ Up to degree: 2
└ Modulo: Finite field of characteristic 1073741827
[ Info: Used specialization points: 21
┌ Info: Final cleaning and simplification of generators. 
└ Out of 41 fractions 21 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 1.73342245 seconds. Result: true
[ Info: Out of 23 initial generators there are 20 indepdendent
[ Info: The ranking of the new set of generators is 210
[ Info: The search for identifiable functions concluded in 79.28406249 seconds
[ Info: Processing SEIR 36 ref
┌ Info: Averaging over 1 runs.
│ Using keyword arguments:
│ NamedTuple{(:with_states, :strategy), Tuple{Bool, Tuple{Symbol, Int64}}}
│ (with_states = true, strategy = (:normalforms, 2))
└ ID: (:normalforms, 2)_with_states
[ Info: Computing IO-equations
┌ Info: Computed in 0.276944784 seconds
│   :ioeq_time = :ioeq_time
└   ioeq_time = 0.276944784
[ Info: Computing Wronskians
┌ Info: Computed in 0.213127533 seconds
│   :wrnsk_time = :wrnsk_time
└   wrnsk_time = 0.213127533
[ Info: Dimensions of the Wronskians [47, 1, 4, 5, 1, 1]
┌ Info: Ranks of the Wronskians computed in 9.4804e-5 seconds
│   :rank_time = :rank_time
└   rank_times = 9.4804e-5
┌ Warning: One of the Wronskians has corank greater than one, so the results of the algorithm will be valid only for multiexperiment identifiability. If you still  would like to assess single-experiment identifiability, we recommend using SIAN (https://github.com/alexeyovchinnikov/SIAN-Julia)
└ @ StructuralIdentifiability ~/StructuralIdentifiability.jl/src/global_identifiability.jl:111
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 1 for num. and 0 for den.
│ Maximal number of interpolated terms are: 1 for num. and 1 for den.
└ Points used: 6.
[ Info: Groebner basis computed in 0.011362526 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 0.045797608 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 12 rational functions
┌ Info: Final cleaning and simplification of generators. 
└ Out of 11 fractions 11 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 0.006916743 seconds. Result: true
[ Info: Out of 53 initial generators there are 11 indepdendent
[ Info: The ranking of the new set of generators is 66
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 1 for num. and 2 for den.
│ Maximal number of interpolated terms are: 1 for num. and 1 for den.
└ Points used: 10.
[ Info: Groebner basis computed in 0.015326926 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 0.00322329 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 22 rational functions
┌ Info: Computing normal forms (probabilistic)
│ Variables (21 in total): Nemo.QQMPolyRingElem[gamma, phi, mu_0, s_d, mu_d, s, mu_i, beta, phi_e, gamma_d, beta_d, N, nu, q, S, E, I, De, Di, R, F]
│ Up to degree: 2
└ Modulo: Finite field of characteristic 1073741827
[ Info: Used specialization points: 21
┌ Info: Final cleaning and simplification of generators. 
└ Out of 41 fractions 21 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 0.004013308 seconds. Result: true
[ Info: Out of 23 initial generators there are 20 indepdendent
[ Info: The ranking of the new set of generators is 210
[ Info: The search for identifiable functions concluded in 0.777361048 seconds
┌ Info: Result is
│   result =
│    20-element Vector{AbstractAlgebra.Generic.Frac{Nemo.QQMPolyRingElem}}:
│     F
│     Di
│     De
│     I
│     ⋮
│     mu_0
│     phi
└     gamma
